Engineering formal metatheory
نویسندگان
چکیده
منابع مشابه
A Generic Formal Metatheory Framework for First-Order Representations
This paper presents GMETA: a generic framework for first-order representations of variable binding that provides once and for all many of the so-called infrastructure lemmas and definitions required in mechanizations of formal metatheory. The framework employs datatype-generic programming and modular programming techniques to provide a universe representing a family of datatypes. This universe ...
متن کاملGMeta: A Generic Formal Metatheory Framework for First-Order Representations
This paper presents GMeta: a generic framework for firstorder representations of variable binding that provides once and for all many of the so-called infrastructure lemmas and definitions required in mechanizations of formal metatheory. The key idea is to employ datatypegeneric programming (DGP) and modular programming techniques to deal with the infrastructure overhead. Using a generic univer...
متن کاملFormal Software Engineering
This seminar investigates how formal methods are used in practical situations, thus we will emphasise real industrial applications. Since the range of possible formal methods is so wide, however, we will be concentrating on only one style, which we will loosely calìmodel based' speciication for imperative , mostly sequential, systems. Thus we complement another, that of Basin, Ganzinger and Pod...
متن کاملFormal Ensemble Engineering
The ‘ensembles’ identified by the InterLink working group on Software Intensive Systems comprise vast numbers of components adapting and interacting in complex and even unforseen ways. If the analysis of ensembles is difficult, their synthesis, or engineering, is downright intimidating. We show, following a recent three-level approach to agent-oriented software engineering, that it is possible ...
متن کاملReverse Engineering through Formal
In this paper we will take a detailed look at a larger example of program analysis by transformation. We will be considering Algorithm 2.3.3.A from Knuth's \Fundamental Algorithms" Knuth (1968) (P.357) which is an algorithm for the addition of polynomials represented using four-directional links. Knuth (1974) describes this as having \a complicated structure with excessively unrestrained goto s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2008
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1328897.1328443